Upgrading nodes in tree-shaped hub location

نویسندگان

  • Víctor Blanco
  • Alfredo Marín
چکیده

Abstract. In this paper, we introduce the Tree of Hubs Location Problem with Upgrading, a mixture of the Tree of Hubs Location Problem, presented in [15], and the Minimum Cost Spanning Tree Problem with Upgraded nodes, studied for the first time in [19]. In addition to locate the hubs, to determine the tree that connects the hubs and to allocate non-hub nodes to hubs, a decision has to be made about which of the hubs will be upgraded, taking into account that the total number of upgraded nodes is given. We present two different Mixed Integer Linear Programming formulations for the problem, tighten the formulations and generate several families of valid inequalities for them. A computational study is presented showing the improvements attained with the strengthening of the formulations and comparing them.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Designing Incomplete Hub Location-routing Network in Urban Transportation Problem

In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...

متن کامل

Logical selection of potential hub nodes in location of strategic facilities by a hybrid methodology of Data Envelopment Analysis and Analytic Hierarchical Process: Iran Aviation case study

Hub facility location problem looks to find the most appropriate location for deploying such facilities. An important factor in such a problem is the pool of potential locations from which the optimal locations must be selected. The present research was performed to address two key objectives: identifying the factors contributing to the selection locations for hub establishment, and presenting ...

متن کامل

Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search

The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...

متن کامل

Genetic and Improved Shuffled Frog Leaping Algorithms for a 2-Stage Model of a Hub Covering Location Network

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....

متن کامل

A Congested Double Path Approach for a Hub Location-allocation Problem with Service Level at Hubs

In this paper an uncapacitated multiple allocation p-hub median problem is discussed. The model minimizes the transportation cost based on inventory service level at hubs through double paths between hubs. Inventory service level is defined as the percent of inventory shortage of vehicles at hubs according to passengers demand and replenishment time of vehicles. A real data from 25 nodes of mun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1802.05252  شماره 

صفحات  -

تاریخ انتشار 2018